The P-center and the P-median Problems in Graphs with Small Number 'ofspanningtrees
نویسنده
چکیده
In this paper, we will describe some algorithms and give their complexity as following: (1) The algorithm for finding a dominating set of radius r in a vertex-weighted graph with small number of spanning tress. The complexity of this algorithm for the unicyclic graph is O(m.n). (2) The algorithm for finding an absolute and vertex p-center of a vertex-weighted graph with small number of spanning trees. The complexity of determining the p-center is O(m.n lgn) for absolute (resp., 0(n lgn) for vertex) p-center in unicyclic graphs. (3) The algorithm for finding a p-median in a vertex-weighted graph with mall number of spanning tress. The complexity of this algorithm for the class of unicyclic graphs is O(m.n.p2)
منابع مشابه
The p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملRelationship Between Sexual Satisfaction and Mental Health in Married Older Women
Background: The aging population is increasing rapidly; therefore, paying attention to the needs of older people is necessary. Sexual satisfaction, which is needed to feel happy, is often neglected in older women. Objective: This study aims to evaluate the relationship between sexual satisfaction and mental health in older women. Materials and Methods: In this analytical study with a cross-s...
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملConcurrent chemoradiotherapy in locally advanced non-small cell lung cancer: a retrospective analysis of the correlation between radiotherapy-related factors and tumor response
Background: To determine which radiotherapy parameters are associated with the tumor response of locally advanced non-small cell lung cancer (NSCLC) patients undergoing concurrent chemoradiotherapy. Materials and Methods: Thirty one patients with IIIA/IIIB NSCLC underwent chemoradiotherapy with a median dose of 63 Gy. On our actual treatments, we made radiotherapy planning to cover the planning...
متن کاملSurvival and Prognostic Factors in Small Cell Lung Cancer Patients in Turkey
Background: Small cell lung cancer (SCLC) is a highly aggressive tumor. Objective: To evaluate the survival and time to progression of patients with SCLC admitted to a chest disease center in Istanbul, Turkey. Methods: Based on the reports of a pulmonary oncology clinic, data regarding performance status (PS), clinical stage of disease, treatment, time to progression and survival of 67 patients...
متن کامل